A Road-Map on Complexity for Hybrid Logics

نویسندگان

  • Carlos Areces
  • Patrick Blackburn
  • Maarten Marx
چکیده

Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages for they internalize the apparatus of labeled deduction. Moreover, they arise naturally in a variety of applications, including description logic and temporal reasoning. Thus it would be useful to have a map of their complexity-theoretic properties, and this paper provides one. Our work falls into two parts. We first examine the basic hybrid language and its multi-modal and tense logical cousins. We show that the basic hybrid language (and indeed, multi-modal hybrid languages) are no more complex than ordinary uni-modal logic: all have pspace-complete K-satisfiability problems. We then show that adding even one nominal to tense logic raises complexity from pspace to exptime. In the second part we turn to stronger hybrid languages in which it is possible to bind nominals. We prove a general expressivity result showing that even the weak form of binding offered by the ↓ operator easily leads to undecidability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Developing Ubiquitous Road Accident Hazard Map (Case Study: Tabriz- Marand Road)

Modeling a road accident hazard zoning map to identify high-risk areas is a very effective step to reduce the resulting casualties. Due to the dynamic nature of many of the factors affecting the identification of these areas, traditional zoning mapping does not seem to be effective. In the field of ubiquitous modeling in the framework of the GIS, it is possible to produce a separate map at any ...

متن کامل

Hybrid Logics on Linear Structures: Expressivity and Complexity

We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algorithmically well behaved. Therefore, they are well suited for the specification of certain properties of computational systems. We show that hybrid logics are more expressive than usual modal and temporal logics on line...

متن کامل

It Takes Two to Tango: Customization and Standardization as Colluding Logics in Healthcare; Comment on “(Re) Making the Procrustean Bed Standardization and Customization as Competing Logics in Healthcare”

The healthcare context is characterized with new developments, technologies, ideas and expectations that are continually reshaping the frontline of care delivery. Mannion and Exworthy identify two key factors driving this complexity, ‘standardization’ and ‘customization,’ and their apparent resulting paradox to be negotiated by healthcare professionals, managers and policy makers. However, whil...

متن کامل

A Road Map of Interval Temporal Logics and Duration Calculi

We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999